An alternative formulation for certain fuzzy set-covering problems
نویسندگان
چکیده
منابع مشابه
Set Covering Problems
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...
متن کاملFuzzy Covering Theory: an Alternative Approach for Diagnostic Problem-solving
Silvia Maria F. S. Massruhá , Sandra Aparecida Sandri, Jacques Wainer 3 Embrapa Informática Agropecuária,EMBRAPA Brazil [email protected] LAC,INPE -Brazil {sandri,silvia}@lac.inpe.br Instituto de Computação,UNICAMP Brazil [email protected] Abstract This paper presents a model of the diagnosis and control that incorporates concepts of abductive inference, fuzzy set logic and decision t...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملAn Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other parameters. Second, it will be shown that results...
متن کاملAn Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other parameters. Second, it will be shown that results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2005
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2004.05.012